Axioms for the Norm Residue Isomorphism
نویسنده
چکیده
We give an axiomatic framework for proving that the norm residue map is an isomorphism (i.e., for settling the motivic Bloch-Kato conjecture). This framework is a part of the Voevodsky-Rost program.
منابع مشابه
The Norm Residue Isomorphism Theorem
We provide a patch to complete the proof of the Voevodsky-Rost Theorem, that the norm residue map is an isomorphism. (This settles the motivic Bloch-Kato conjecture).
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملThe Indecomposable K3 of Fields
In this note, we describe an extension of Hubert's Theorem 90 for K2 of fields to the relative K<i of semilocal PID's containing a field. Most of the results for K2 of fields proven in [M-S and S] then carry over to the relative K% of semilocal PID's containing a field, e.g. computation of the torsion subgroup, and the norm residue isomorphism. Applying this to the semilocal ring of {0,1} in A^...
متن کاملTesting Linear-Invariant Function Isomorphism
A function f : F2 → {−1, 1} is called linear-isomorphic to g if f = g ◦ A for some non-singular matrix A. In the g-isomorphism problem, we want a randomized algorithm that distinguishes whether an input function f is linear-isomorphic to g or far from being so. We show that the query complexity to test g-isomorphism is essentially determined by the spectral norm of g. That is, if g is close to ...
متن کاملPolynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006